A Hitting Set Construction, with Applications to Arithmetic Circuit Lower Bounds
نویسنده
چکیده
A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form Pt j=0 cjX αj (a+ bX)j . From our algorithm we derive an exponential lower bound for representations of polynomials such as
منابع مشابه
A hitting set construction, with application to arithmetic circuit lower bounds
A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j X^{\alpha_j} (a + b X)^{\beta_j}$. From our algorithm we derive an exponential lower bound for representations of polynomials such as $\prod_{i=1}^{2^n} (X^i-1)$ un...
متن کاملPermanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
We show that over fields of characteristic zero there does not exist a polynomial p(n) and a constant-free succinct arithmetic circuit family {Φn}, where Φn has size at most p(n) and depth O(1), such that Φn computes the n × n permanent. A circuit family {Φn} is succinct if there exists a nonuniform Boolean circuit family {Cn} with O(logn) many inputs and size n such that that Cn can correctly ...
متن کاملSmall hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good
Research in the last decade has shown that to prove lower bounds or to derandomize polynomial identity testing (PIT) for general arithmetic circuits it suffices to solve these questions for restricted circuits. In this work, we study the smallest possibly restricted class of circuits, in particular depth-4 circuits, which would yield such results for general circuits (that is, the complexity cl...
متن کاملHitting-Sets for ROABP and Sum of Set-Multilinear Circuits
We give a nO(log n)-time (n is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious arithmetic branching programs (ROABP). The best time-complexity known for blackbox PIT for this class was nO(log 2 n) due to Forbes-SaptharishiShpilka (STOC 2014). Moreover, their result holds only when the individual degree is small, while we do not need any such ...
متن کاملAsymptotically Optimal Hitting Sets Against Polynomials
Our main result is an efficient construction of a hitting set generator against the class of polynomials of degree di in the i-th variable. The seed length of this generator is logD + O (̃logD). Here, logD = ∑ i log(di + 1) is a lower bound bound on the seed length of any hitting set generator against this class. Our construction is the first to achieve asymptotically optimal seed length for eve...
متن کامل